package com.wwz.leetcode;

public class PrimeNumber {
    public static void main(String[] args) {
        int count = 0;
        int j;
        for (int i = 2; i <= 100; i++) {
            for (j = 2; j < i; j++) {
                if (i % j == 0) {
                    break;
                }
            }
            if (j == i) {//只能被自己整除
                count += i;
            }
        }
        System.out.println(count);

    }
}
